منابع مشابه
Computing Minimum Area Homologies
Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any h...
متن کاملComputing minimum-area rectilinear convex hull and L-shape
Article history: Received 21 February 2008 Accepted 24 February 2009 Available online 24 March 2009 Communicated by T. Asano
متن کاملAn Algorithm for Computing Some Heegaard Floer Homologies
In this paper, we give an algorithm to compute the hat version of the Heegaard Floer homology of a closed oriented three-manifold. This method also allows us to compute the filtrations coming from a null-homologous link in a three-manifold.
متن کاملFinding Minimum Area k-gons
Given a set P of n points in the plane and a number k, we want to find a polygon ~ with vertices in P of minimum area that satisfies one of the following properties: (1) cK is a convex k-gon, (2) ~ is an empty convex k-gon, or (3) ~ is the convex hull of exactly k points of P. We give algorithms for solving each of these three problems in time O(kn3). The space complexity is O(n) for k = 4 and ...
متن کاملMinimum Area Polyomino Venn Diagrams
Polyomino Venn (or polyVenn) diagrams are Venn diagrams whose curves are the perimeters of polyominoes drawn on the integer lattice. Minimum area polyVenn diagrams are those in which each of the 2n intersection regions, in a diagram of n polyominoes, consists of exactly one unit square. We construct minimum area polyVenn diagrams in bounding rectangles of size 2r×2c whenever r, c ≥ 2. Our const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2014
ISSN: 0167-7055
DOI: 10.1111/cgf.12514